Sampling-based robot motion planning: Towards realistic applications

نویسندگان

  • Konstantinos I. Tsianos
  • Ioan Alexandru Sucan
  • Lydia E. Kavraki
چکیده

This paper presents some of the recent improvements in sampling-based robot motion planning. Emphasis is placed on work that brings motion-planning algorithms closer to applicability in real environments. Methods that approach increasingly difficult motion planning problems including kinodynamic motion planning and dynamic environments are discussed. The ultimate goal for such methods is to generate plans that can be executed with few modifications in a real robotics mobile platform.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exploiting Contact for Efficient Motion Planning Under Uncertainty

In this paper we want to argue for contact as an enabler for efficient motion planning under uncertainty. Controlled and desired contact can project a high dimensional belief state to a lower-dimensional manifold. A robot can sequence these projections to reduce uncertainty about its state. For realistic applications, these uncertainty reducing actions must be sequenced with uncertainty-increas...

متن کامل

Mobile Robot Online Motion Planning Using Generalized Voronoi Graphs

In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...

متن کامل

Sampling-BasedMethods for Motion Planning with Constraints

Robots with many degrees of freedom (e.g., humanoid robots andmobile manipulators) have increasingly been employed to accomplish realistic tasks in domains such as disaster relief, spacecraft logistics, and home caretaking. Finding feasible motions for these robots autonomously is essential for their operation. Sampling-basedmotion planning algorithms have been shown to be effective for these h...

متن کامل

Towards a Probabilistic Roadmap for Multi-robot Coordination

In this paper, we discuss the problem of multirobot coordination and propose an approach for coordinated multi-robot motion planning by using a probabilistic roadmap (PRM) based on adaptive cross sampling (ACS). The proposed approach, called ACS-PRM, is a samplingbased method and consists of three steps including Cspace sampling, roadmap building and motion planning. In contrast to previous app...

متن کامل

Motion Planning for Mobile Robots Via Sampling-Based Model Predictive Optimization

Path planning is a method that determines a path, consecutive states, between a start state and goal state, LaValle (2006). However, in motion planning that path must be parameterized by time to create a trajectory. Consequently, not only is the path determined, but the time the vehicle moves along the path. To be successful at motion planning, a vehicle model must be incorporated into the traj...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Science Review

دوره 1  شماره 

صفحات  -

تاریخ انتشار 2007